The pa-Regular Partition Function Modulo pj
نویسندگان
چکیده
منابع مشابه
Distribution of the partition function modulo
and he conjectured further such congruences modulo arbitrary powers of 5, 7, and 11. Although the work of A. O. L. Atkin and G. N. Watson settled these conjectures many years ago, the congruences have continued to attract much attention. For example, subsequent works by G. Andrews, A. O. L. Atkin, F. Garvan, D. Kim, D. Stanton, and H. P. F. Swinnerton-Dyer ([An-G], [G], [G-K-S], [At-Sw2]), in t...
متن کاملDistribution of the Partition Function modulo Composite Integers M
seem to be distinguished by the fact that they are exceptionally rare. Recently, Ono [O1] has gone some way towards quantifying the latter assertion. More recently, Ono [O2] has made great progress on the complementary question. Namely, he proves that if M ≥ 5 is prime, then there are in fact infinitely many congruences of the form (1.1). Using the ideas in [O2], Weaver [We] has recorded over 7...
متن کاملA Gcd-Sum Function Over Regular Integers Modulo n
We introduce a gcd-sum function involving regular integers (mod n) and prove results giving its minimal order, maximal order and average order.
متن کاملThe Regular Viewpoint on Pa−processes the Regular Viewpoint on Pa-processes
PA is the process algebra allowing non-determinism, sequential and parallel compositions, and recursion. We suggest a view of PA-processes as tree languages. Our main result is that the set of iterated predecessors of a regular set of PA-processes is a regular tree language, and similarly for iterated successors. Furthermore, the corresponding tree-automata can be built eeectively in polynomial...
متن کاملGCD Computations Modulo Regular Chains
The computation of triangular decompositions involves two fundamental operations: polynomial GCDs modulo regular chains and regularity test modulo saturated ideals. We propose new algorithms for these core operations based on modular methods and fast polynomial arithmetic. We rely on new results connecting polynomial subresultants and GCDs modulo regular chains. We report on extensive experimen...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Number Theory
سال: 2002
ISSN: 0022-314X
DOI: 10.1006/jnth.2001.2736